离散小波变换在被动声目标识别中的应用

研究了战场被动声目标鲁棒特征参数的提取,分析了战场声信号与语音信号特征的相似性,提出基于MFCC参数的战场声目标识别方法。针对战场环境存在强噪声干扰情况,提出一种改进的MFCC特征参数(DWTMFCC)提取方法,该方法将小波分析和MEL倒谱分析结合,提高了特征参数的鲁棒性。仿真结果表明:在噪声条件下,利用DWTMFCC参数进行声目标识别,平均识别率比MFCC参数高出3.134个百分点,信噪比为5dB时,识别率仍达到93.67%。     

“前进一步自然宽”——也谈军事战略思维“转型”

军事战略思维转型是推进中国特色军事变革的内在要求和重要组成部分，也是信息化条件下加强军队建设的一项重要内容。中国特色军事变革，不仅需要器物层面变革的支撑，更需要以军事战略思维转型为核心的精神层面变革的引领。     

基于线对线突然短路的同步电机瞬态参数辨识

准确地辨识同步电机参数,是分析电力系统运行和控制系统设计的前提.利用最小二乘或卡尔曼滤波等方法辨识电机三相同时突然短路试验数据,是传统电机参数辨识的主要方式.受同步电机三相同时突然短路的可操作性和电机参数模型的强非线性等因素的影响,电机瞬态参数难以准确测量.利用改进的小波变换和人工神经元网络辨识参数的新方法,结合容易实现的同步电机线对线突然短路试验,辨识得到了三相同步电机的瞬态参数,有效提高了电机参数的辨识精度.仿真试验表明,该方法是有效的.     

基于误差传递和逐步回归法的火控系统精度分析

利用坐标变换得到射击诸元解算模型,根据得到的射击诸元解算模型的教学表达式,用隐函数微分法得到每个射击诸元影响因素的误差传递系数,利用精度分析模型建立射击诸元精度表达式.然后用均匀试验设计法确定典型射击条件,在这些典型射击条件下,计算各误差传递系数,根据给定的某组火控系统各设备的精度指标,进而计算火控系统各典型射击条件下的火控系统精度值,并确定合理的精度指标期望值.要获得这组火控系统各设备的精度指标下,任意指定射击条件下的系统精度值,利用已算出的各典型射击条件下的系统精度值,采用逐步回归分析方法,可获得火控系统各射击诸元参数的精度与各射击条件的函数关系近似表达式.     

基于改进整型遗传算法的稀疏矩形平面阵列优化

为了降低固定稀疏率、固定孔径的稀疏矩形阵列的峰值旁瓣电平,提出一种改进整型遗传算法。该算法在整型遗传算法的基础上,提出了等间隔采样的交叉策略、多点变异策略以及优良基因重组的策略。采取等间隔采样的基因交叉方式,可以有效发挥整型编码的优势,从而提高算法的运行效率;为了提高种群的多样性,防止算法陷入局部最优,采用了多点变异策略;采用优良基因重组技术,加快了算法的收敛速度。仿真结果表明,相比传统的二进制和实数编码,整型编码更为直接高效;与用于稀疏矩形阵列优化的相关算法相比,本文所提算法获得了更优的旁瓣电平,证实了算法的有效性和优越性。     

加权核范数最小化和改进小波阈值函数的图像去噪算法

针对加权核范数最小化算法存在结构残余噪声以及无法较好地保持图像边缘结构的问题,提出基于加权核范数最小化和改进小波阈值函数的图像去噪算法。利用全变分模型对噪声图像进行初步去噪,使用噪声图像与初步去噪后的图像进行差分运算,对差分后得到的噪声残差图像使用改进的小波阈值函数去噪,将小波去噪后的残差图像与初步去噪图像叠加,将叠加后的图像使用基于残余噪声水平迭代的加权核范数最小化算法进行二次去噪。相较于当下主流去噪算法,经该算法处理后的图像的PSNR和SSIM值均有所提升,能够更好地保持图像的纹理结构,且在高噪声环境下效果更佳。     

面向数字射频存储的雷达欺骗干扰检测方法

基于数字射频存储(digital radio frequency memory,DRFM)技术的转发式欺骗干扰与真实雷达回波高度相干,这导致雷达难以分辨真假目标。针对该问题,提出一种基于Hough变换的DRFM欺骗干扰检测方法。建立基于线性调频的干扰信号模型,分析其谐波分量的频谱特性,采用短时傅里叶变换和二维恒虚警率检测器对干扰信号进行特征提取,并利用Hough变换完成欺骗干扰检测。所提方法是基于DRFM欺骗干扰本身的特征,不依赖于先验信息与应用场景,计算复杂度低,且在低信噪比条件下具有良好的检测性能。计算机仿真实验验证了方法的有效性。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

自适应控制中的Hartley块算法及实验

针对小波包自适应控制子频带内包含大量卷积和相关运算导致算法收敛速度慢的问题,提出基于Hartley块的小波包滤波最小均方算法。将快速Hartley变换引入块算法,实现频域内快速卷积和相关运算;在子频带内应用Hartley块算法生成控制信号,通过重叠保留法提出基于Hartley块的小波包滤波最小均方算法;通过仿真和实验研究了定频和扫频两种工况下的隔振性能和控制效果。结果表明,基于Hartley块的小波包滤波最小均方算法不仅可以大幅缩短收敛时间,还能显著提高控制精度,且鲁棒性和稳定性良好,能够很好地应用在工程实际中。